Snap-Stabilizing PIF on Non-oriented Trees and Message Passing Model
نویسندگان
چکیده
Starting from any configuration, a snap-stabilizing protocol guarantees that the system always behaves according to its specification while a self-stabilizing protocol only guarantees that the system will behave according to its specification in a finite time. So, a snap-stabilizing protocol is a time optimal self-stabilizing protocol (because it stabilizes in 0 rounds). That property is very suitable in the case of systems that are prone to transient faults. There exist a lot of approaches of the concept of self-stabilization, but to our knowledge, snap-stabilization is the only variant of self-stabilization which has been proved power equivalent to self-stabilization in the context of the state model (a locally shared memory model) and for non anonymous systems. So the problem of the existence of snap-stabilizing solutions in the message passing model is a very crucial question from a practical point of view. In this paper, we present the first snap-stabilizing propagation of information with feedback (PIF) protocol for non-oriented trees in the message passing model. Moreover using slow and fast timers, the round complexity of our algorithm is in θ(h×k) and θ((h×k)+k), respectively, where h is the height of the tree and k is the maximal capacity of the channels. We conjecture that our algorithm is optimal.
منابع مشابه
Optimal snap-stabilizing PIF algorithms in un-oriented trees
A snap-stabilizing protocol, starting from any arbitrary initial system configuration, always behaves according to its specification. In other words, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in zero steps. In this paper, we first prove the number of states required on processors to design a snap-stabilizing Propagation of Information with Feedback (PIF) algori...
متن کاملOptimal PIF in Tree Networks
In this paper, we consider rooted tree networks, as well as trees without sense of direction. We propose a new PIF scheme, called Propagation of Information with Feedback and Cleaning (PF C ). We present both selfstabilizing and snap-stabilizing PF C algorithms. A self-stabilizing system, regardless of the initial states of the processors and initial messages in the links, is guaranteed to conv...
متن کاملSnap-Stabilization in Message-Passing Systems Brief Announcement
In this announcement, we report recent results [4] (available at http://arxiv.org/abs/0802. 1123) where we address the open problem of snap-stabilization in message-passing systems. The concept of snap-stabilization [3] offers an attractive approach to transient fault tolerance. As soon as such fault ends a snap-stabilizing protocol immediately operates correctly. Of course, not all safety pred...
متن کاملThe expressive power of snap-stabilization
A snap-stabilizing algorithm, regardless of the initial configuration of the system, guarantees that it always behaves according to its specification. We consider here the locally shared memory model. In this model, we propose the first snap-stabilizing Propagation of Information with Feedback (PIF) algorithm for rooted networks of arbitrary connected topology which is proven assuming the distr...
متن کامل